Truly selective polygonal mesh hierarchies with error control

نویسنده

  • Stefan Gumhold
چکیده

In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The new hierarchical mesh representation combines a truly selective refinement scheme with a strict control of the two-sided Hausdorff distance. The proposed approach allows to build hierarchical meshes directly over non triangulated polygonal models. As most dependencies in the hierarchy are in the form of trees, the resulting representation is very compact and allows for a compressed in-core representation. Furthermore an optimization scheme is proposed for the hierarchy based on variational shape approximation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polygonal Mesh Simplification with Face Color and Boundary Edge Preservation Using Quadric Error Metric

In the applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and to construct the mult...

متن کامل

A Node Reconnection Algorithm for Mimetic Finite Difference Discretizations of Elliptic Equations on Triangular Meshes

Most efficient adaptive mesh methods employ only a few strategies, including local mesh refinement (h-adaptation), movement of mesh nodes (r-adaptation), and node reconnection (c-adaptation). Despite of its simplicity, node reconnection is the least popular of the three. However, using only node reconnection the discretization error can be significantly reduced. In this paper, we develop and nu...

متن کامل

Tsallis Entropy for Geometry Simplification

This paper presents a study and a comparison of the use of different information-theoretic measures for polygonal mesh simplification. Generalized measures from Information Theory such as Havrda–Charvát–Tsallis entropy and mutual information have been applied. These measures have been used in the error metric of a surface simplification algorithm. We demonstrate that these measures are useful f...

متن کامل

Adaptive Bem-based Fem on Polygonal Meshes from Virtual Element Methods

Polygonal meshes are especially suited for the discretization of boundary value problems in adaptive mesh refinement strategies. Such meshes are very flexible and incorporate hanging nodes naturally. But only a few approaches are available that handle polygonal discretizations in this context. The BEM-based Finite Element Method (FEM) and a residual based error estimate are reviewed in the pres...

متن کامل

Optimal Control in Nonconvex Domains: a Priori Discretization Error Estimates

An optimal control problem for a 2-d elliptic equation is investigated with pointwise control constraints. The domain is assumed to be polygonal but non-convex. The corner singularities are treated by a priori mesh grading. Approximations of the optimal solution of the continuous optimal control problem will be constructed by a projection of the discrete adjoint state. It is proved that these a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2005